First-Order Logic with Two Variables and Unary Temporal Logic
نویسندگان
چکیده
منابع مشابه
First-Order Logic with Two Variables and Unary Temporal Logic
We investigate the power of first-order logic with only two variables over ω-words and finite words, a logic denoted by FO. We prove that FO can express precisely the same properties as linear temporal logic with only the unary temporal operators: “next”, “previously”, “sometime in the future”, and “sometime in the past”, a logic we denote by unary-TL. Moreover, our translation from FO to unary...
متن کاملEquality and Monodic First-Order Temporal Logic
It has been shown recently that monodic first-order temporal logic without functional symbols but with equality is incomplete, i.e. the set of the valid formulae of this logic is not recursively enumerable. In this paper we show that an even simpler fragment consisting of monodic monadic two-variable formulae is not recursively enumerable.
متن کاملDecidability of Cylindric Set Algebras of Dimension Two and First-Order Logic with Two Variables
The aim of this paper is to give a new proof for the decidability and nite model property of rst-order logic with two variables (without function symbols), using a combinatorial theorem due to Herwig. The results are proved in the framework of polyadic equality set algebras of dimension two (Pse 2). The new proof also shows the known results that the universal theory of Pse 2 is decidable and t...
متن کاملTemporal logic programs with variables
In this note we consider the problem of introducing variables in temporal logic programs under the formalism of Temporal Equilibrium Logic (TEL), an extension of Answer Set Programming (ASP) for dealing with linear-time modal operators. To this aim, we provide a definition of a first-order version of TEL that shares the syntax of first-order Linear-time Temporal Logic (LTL) but has a different ...
متن کاملProof Planning for First-Order Temporal Logic
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal Logic (FOLTL), which can be seen as a quantified version of Linear Temporal Logic, overcoming its finitary limitation. Automated reasoning in FOLTL is hard, since it is non-recursively enumerable; but its expressivenes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 1997
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v4i5.18784